IEEE/ACM Transactions on Computational Biology and Bioinformatics

Background and Objective: Prescribing multiple drugs simultaneously, known as polypharmacy, is increasingly common in managing chronic diseases such as diabetes and cardiovascular conditions. Studies show that roughly 40% of elderly patients are on five or more medications, putting them at significant risk of adverse drug-drug interactions (DDIs) [1]. While computational methods based on Graph Neural Networks (GNNs) have shown strong potential for predicting these interactions from a drugs molecular structure, most existing models are limited in two important ways: they rely on attention mechanisms that cannot adapt to the unique context of each atom in a molecule, and they only predict whether an interaction exists rather than how dangerous it might be. Methods: We propose HMVA-DDI, a two-stage deep learning framework that addresses both shortcomings. In the first stage, our model predicts whether two drugs will interact. If it detects an interaction, the second stage classifies it into one of three clinical severity levels: minor, moderate, or major. To better capture molecular structure, we replace the standard attention mechanism with a more powerful version called Graph Attention Network v2 (GATv2), which considers each atoms specific context when learning its representation. We also introduce a technique to prevent information loss in deeper network layers, and we tailor the input features separately for each prediction task. Results: Evaluated on two standard benchmarks, DrugBank 5.0.3 [2] and DDInter [3], HMVA-DDI achieves an AUROC of 0.9819 and AUPRC of 0.9759 on binary interaction detection, a marked improvement over the baseline. For severity classification, our best model variant (qcSvr4) reaches an overall AUROC of 0.9444, with a particularly large improvement in detecting low-severity (Minor) interactions, a historically difficult class. Conclusion: HMVA-DDI bridges the gap between computational drug research and clinical usefulness by not only predicting interactions accurately but also indicating interaction severity. This two-level system can help healthcare professionals prioritize warnings, reducing the alert fatigue problem where doctors are overwhelmed by too many non-critical notifications.

1Drug--drug interactions between biotech and small-molecule drugs play a critical role in medication safety and therapeutic efficacy. However, most existing computational DDI prediction methods focus primarily on interactions between small-molecule drugs, leaving biotech-small-molecule interactions comparatively underexplored. In this study, we propose B-SMART-Former, an explainable deep learning framework for predicting interaction types between biotech and small-molecule drugs. The proposed framework integrates ChemBERTa embeddings and Morgan molecular fingerprints for small molecules with ProtBERT embeddings for biotech drugs, eliminating the need for similarity-based features while leveraging complementary molecular representations. These multimodal features are processed by a hybrid architecture that combines Transformer-based self-attention, residual convolutional learning, and a multi-layer perceptron classifier to capture both global contextual dependencies and local discriminative patterns. The model is formulated as a multi-class classification task and evaluated using stratified 10-fold cross-validation. To improve model transparency, Integrated Gradients is employed as a post-hoc explainability method to identify the molecular features that contribute most strongly to each prediction. Experimental results demonstrate that B-SMART-Former achieves a micro-averaged AUROC of 0.9978 and an AUPR of 0.9682 while relying solely on intrinsic molecular representations, remaining competitive with similarity-based approaches. The proposed framework offers an effective and explainable solution for biotech-small-molecule DDI prediction and provides a practical foundation for future computational drug interaction studies.

In recent years, the issue of reproducibility in scientific studies has been at the forefront of scientific discussion. Many of these issues arise due to poor employment of statistical methods, making it crucial to address these knowledge gaps for frequently used methods. Elastic net regression (ENET) is one such algorithm used frequently in biology and public health due to its ability to select important predictors (also known as "features") from large data sets. However, ENET struggles with consistent feature selection and hyperparameter choice in these applications due to low observation counts and noisy data. This limitation hinders ENET's effectiveness in biological research due to low model reproducibility and predictor interpretability. We propose the Instability Quotient Criterion (IQC) as a metric to quantify the consistency of selected features for feature selection models such as ENET, with a specific emphasis on biological applications. IQC leverages ensemble modeling and Shannon's entropy in order to determine the stability of selected features derived from ENET models. We demonstrate IQC's robustness via simulation studies, showing that IQC is capable of detecting significant decreases in model stability with lower observation counts, higher dimensionality, and higher proportions of noisy signal. We additionally utilize simulation to provide a naive threshold for low versus high stability. Finally, we applied IQC to a case study to illustrate how our method can be integrated into a larger analysis pipeline when looking at microarray gene expression data. IQC indicated stability issues for differentially-expressed genes when classifying acute leukemia subtypes in spite of high classification success. Lastly, we discuss how model instability impedes interpretation of biologically significant genes for discerning cancer subtypes. Overall, we present IQC as a robust evaluation metric that can easily be incorporated into high-dimensional biological analyses.

In network biology, analyzing pathways is critical to study mechanisms or sequences of biological events. The pathway co-membership approach aims to link proteins belonging to the same pathway inside a network that is a clique. Although this method is great for projecting pathway knowledge onto proteins, it remains unsuitable for some downstream applications relying on graph distances like random walks with restart. To address this limitation, we introduce a weighted pathway co-membership method that incorporates biological distances between proteins. We achieve this by developing an abstraction framework for Reactome pathways, which captures both their hierarchical organization and sequential relationships. By assigning weights to these abstractions, we define a scoring system for proteins within the pathway co-membership clique. We illustrate our approach using a Reactome pathway ("Signaling by TGF-beta receptor complex", R-HSA-170834), and explain how we generate the weighted co-membership cliques of the 29 Reactome top-level pathways. Next, we construct the entire weighted pathway co membership network of the Reactome knowledge base. Validation and evaluation of our method is performed using cancer hallmark gene sets and a random walk with restart experiment, comparing our approach to state-of-the-art methods. We show that our approach outperforms state-of-the-art methods for gene prioritization on cancer hallmarks.

In network medicine, the protein-protein interaction network, or interactome, is an essential resource for identifying candidate proteins underlying diseases and other phenotypic traits. Indeed, it can be leveraged via the guilt-by-association paradigm, which asserts that interacting proteins are likely to participate in the same molecular processes. Network propagation that combines the topology of the interactome with prior knowledge about disease genes is a promising strategy to identify new candidate genes contributing to diseases. However, existing network propagation algorithms are often biased toward highly connected proteins, called "hubs". We present BFWalk, a novel network propagation algorithm designed to avoid inflated scores for hubs. We tested BFWalk across four human phenotypes: multiple morphological abnormalities of the sperm flagella, dyschromatopsia, hypertrophic cardiomyopathy, and chronic kidney disease. For each phenotype, we assessed whether BFWalk could recover known phenotype-associated genes and whether new candidate genes were enriched in relevant tissues. Depending on the phenotype, BFWalk outperformed or matched the state-of-the-art network propagation methods. Furthermore, the results confirmed that BFWalk is free of bias toward high-degree nodes. Therefore, BFWalk is a powerful method for identifying new genes across diverse phenotypes and constitutes a strong alternative to existing network propagation algorithms. Availability: BFWalk is implemented in Python and C. The code is available under the GNU GPL (v3.0) on: https://github.com/jedrzejkubica/BFWalk

The -Bonacci weighted sequence space {ell}(,) is introduced for [&ge;] 2, 1 [&le;] < {infty}, and > 0). It is proved to be a Banach space which is isometrically isomorphic to {ell}, with an unconditional Schauder basis. The space is also reflexive and uniformly convex. Its strict inclusion chain, continuous dual, and asymptotic truncation estimate of order - / are also established. Based on this framework, Scaled &#119898-BonacciNet is proposed as a lightweight CNN that rescales Fibonacci-Net channels using the dominant &#119898-Bonacci root and employs depth wise separable convolutions. Tribonacci-Net achieved 96.09% accuracy and a 0.9581 macro F1-score on the 15-class Brain MRI dataset using 0.85 million parameters and 0.366 GFLOPs. Pentanacci-Net attained 95.87% accuracy on the 44-class dataset while reducing parameters and FLOPs by 47.10% and 44.48%, respectively. On the CKD ultrasound dataset, Hexanacci-Net achieved 83.75% accuracy and a 0.7941 macro F1-score, with corresponding reductions of 50.37% and 45.10%. These findings support dominant-root scaling as a structured approach to lightweight CNN design.

Since copy number variations (CNVs) in pharmacogenes can cause significant alterations in drug metabolism, their reliable detection is of high importance both for large-scale studies and personalized medicine. Whole-genome sequencing, and specifically long-read sequencing, is the gold standard for CNV detection. Despite increasing availability of these technologies, genotyping arrays are still widely used as cost-effective alternatives in biobank and clinical settings, yet calling CNVs based on array intensity signals is challenging due to low base pair resolution. In this work, we developed a neural network model, nnCNV, to predict deletions in the CYP2C19 pharmacogene region from array intensity signals. We compared our method to the most widely used algorithm, PennCNV, and demonstrated better performance reaching 100% accuracy in the test dataset. Furthermore, we predicted probe-by-probe CYP2C19 deletion coordinates for all Estonian Biobank samples using nnCNV and PennCNV, and validated these predictions using an identity-by-descent (IBD) sharing method, which also demonstrated superior nnCNV performance. For the deletion samples with conflicting PennCNV and nnCNV predictions, we performed PCR analysis for validation, which showed 97% precision for nnCNV compared to 23% for PennCNV. Finally, we assessed the gradient-based feature importance maps and showed that nnCNV utilizes signal intensity information not only from deletion probes, but also from probes in flanking regions. Our results demonstrate that long-range information, which cannot be utilized by hidden Markov models, can improve CNV calling.

Motivation: Graph Neural Networks (GNNs) have gained increasing interest in the biomedical domain, as the integration of prior knowledge and deep neural networks has the potential to enhance insights into molecular processes and disease mechanisms. However, a comprehensive and systematic assessment of model architectures, data modalities, graph structures, and their performance for graph signal classification in the biomedical domain is yet to be performed. In order to close this gap, we conducted a benchmarking study on multiple GNNs on a Protein-Protein Interaction (PPI) network for Kidney Renal Clear Cell Carcinoma and Breast cancer subtype prediction, performing an in-depth investigation of architectures, incorporating skip connections and various data modalities. Results: While none of the GNNs outperforms the structure-agnostic Multi-Layer Perceptron baseline, all of them can handle bimodal data (gene methylation and expression) and offer the ability to gain explainability based on PPIs. We offer practical guidelines for applying GNNs to graph signal processing tasks specifically for cancer classification. Depending on the underlying dataset and PPI structure employed, models on different data modalities outperform others. Overall, we suggest using ChebNet, which tends to outperform the Graph Convolutional Network and the Graph Attention Network in cancer subtype prediction. We recommend using GNN architectures that employ a simple flattening readout layer, as they provide better classification performance and faster training time than those with global average pooling. Additionally, we tested residual connections, but they had only an insignificant impact on classification performance.

In this work, we present a machine learning model for identifying pathogenic DNA variants. The model was learned from the analysis of normal and pathogenic sequences extracted from the ClinVar database (supported by NCBI). This analysis was based on a conceptual semantic model of DNA sequences converted to peptide sequences (amino acid sequences) governed by a well-defined grammar, which allowed us to apply NLP techniques, specifically Part of Speech tagging (POS tagging). Our predictive model was built by combining two techniques: CRF (from the Markov model family), which performs the sequencing, and BiLSTM (a deep learning model) which captures the past and future content of the sequences. The training space was created with the sequences of 105 genes associated with approximately 27,000 pathogenic variants. The model was evaluated using the metrics precision, P-R and ROC curves, AUC, and confusion matrices. Its performance was also compared against five known methods for predicting pathogenic variants. The results show exceptional performance that exceeds expectations and places this new method at the state of the art for predicting pathogenic DNA sequences.

Across metazoa, morphogen gradients differentially regulate gene expression and activate a spatially distinct program to specify body axis development. The Drosophila gap gene network, initiated by maternal morphogen Bicoid, is one of the most well-studied systems. Several regulatory interactions act synergistically to produce distinct gap gene expression patterns along the anterior-posterior (AP) axis of the blastoderm stage Drosophila embryo to ensure the proper segmentation of the larval and, eventually, adult stage fly. Several mathematical models have been proposed to summarize the interconnectivity of gap gene regulatory elements and predict expression in mutant systems. However, these models have not successfully predicted the gap gene expression profile over the entire AP axis. Here, we present an Enhancer Activity-informed Gap GEne Regulatory network (EAGER) model that incorporates enhancer activity-driven differential regulation along the AP axis, which successfully summarizes gap gene expression patterns over the entire AP axis. We validated the predictions of EAGER on Kr mutants and performed a comprehensive parametric sensitivity and identifiability analysis to evaluate the robustness of the EAGER model fits and predictions. We also propose a reduced version of the model, rEAGER, which identifies a minimal set of regulatory interactions and successfully summarizes the gap gene interactions over the entire AP axis. Our results suggest that the expression driven by individual enhancers must be accounted for in models of developmental pattern formation.

Identification of differentially expressed genes is a crucial step for downstream tasks on gene data such as biomarker discovery, drug target identification. Traditional Methods assume negative binomial distribution on RNA-sequence data and models the DEGs using either generalized linear models or by estimating dispersion and assumption of mean-variance rate. The proposed method uses axiomatic approach by using quantum mechanics principles to project transcript data onto a Hilbert space using a composite kernel. Using the curvature generated by the transcripts on the latent manifold within the Hilbert space, a gravitational search inspired mechanism is used to identify the optimal number of differentially expressed genes by minimizing a representational loss function, and a reduced gene feature space is constructed as the potential differentially expressed genes. The proposed method has been compared with existing empirical methods for validation using proper statistical and biological benchmark analysis.

Standard polygenic risk scores (PRSs) are constructed based on additive genome-wide association study (GWAS) summary statistics. Nonlinear machine learning methods have been increasingly applied to construct PRSs directly from individual-level data, with the aim of improving predictive performance over standard PRSs through their ability to model non-additive genetic effects. However, their superiority across studies has been inconsistent, and the conditions under which they provide meaningful improvements remain unclear. We combined theoretical analysis, simulations and a real-world application to investigate when two widely used nonlinear machine learning methods, random forest and XGBoost, outperform standard PRSs. Theoretical analysis showed that standard PRSs can implicitly capture part of the genetic variance attributable to nonadditive genetic effects through their contributions to marginal SNP effects, thereby losing less information than commonly assumed. Although nonlinear models have a higher theoretical potential, their greater flexibility incurs a bias-variance trade-off that can limit predictive gains at finite sample sizes. Simulations showed that XGBoost outperformed the standard PRS only when the genetic architecture involves a sufficiently large proportion of interaction genetic variance concentrated across relatively few interaction effects and large training samples were available. Random forest consistently underperformed the standard PRS. In an application to ischemic heart disease prediction using UK Biobank data, XGBoost showed no meaningful improvement in predictive performance over the standard PRS, whereas random forest again performed worse. Together, these findings suggest that nonlinear machine learning do not uniformly outperform standard PRSs; rather, their relative performance depends jointly on genetic architecture and training sample size. Our study helps to reconcile the inconsistent results reported across previous studies and provides a framework for identifying settings in which more complex PRS models are likely to be beneficial.

Learning from imbalanced data remains a major challenge for graph neural networks (GNNs), as minority nodes are not only rare but also structurally marginalized within the graph. We address this issue with CLARA, a hierarchical learning framework that decomposes node classification into two stages: a coarse subgraph-level classifier that selects regions likely to contain minority instances, followed by a fine-grained node-level predictor within these regions. This design improves sensitivity while maintaining scalability, filtering out irrelevant areas and focusing learning on topologically meaningful neighborhoods. Experiments on benchmark graph datasets demonstrate substantial gains over established imbalance-handling methods, with CLARA reaching an F1-score of 88.3\%. The same strategy achieves significant improvements in protein-ligand binding site prediction, underscoring its broad and consistent effectiveness across both biological and general graph learning tasks.

Several tools are available to detect differential gene expression. The predominant approach of different statistical methods is to consider changes in gene expression independent from their genomic context. Previously, DELocal was introduced that takes into consideration gene expression dynamics in the genomic neighbourhood. Whereas DELocal was shown to identify developmentally regulated genes in developing mouse tooth, its performance in other biological conditions remains undetermined. To benchmark DElocal together with other methods, we develop another tool 'broadSeq'. It provides easy to use interface for methods like DELocal , deseq2, limma, edger, EBSeq and many more. Here we report benchmarking results on different data sets that comprise wild type developing mouse organs from different embryonic time points, and also human cancer data. The examined datasets are from the heart, kidney, liver, brain, forebrain, and hindbrain. We found that most methods produce relatively comparable lists of differentially expressed genes. Nevertheless, DELocal identifies partially distinct sets of genes compared to the other methods. Evaluating the identified genes using gene and disease ontology terms show that the uniquely detected genes by DELocal are biologically relevant and also highly expressed compared to the genes identified by the other methods. Because consistently highly expressed genes show relatively subtle fold changes, the neighbourhood concept of DELocal appears to correct for the difficulty in detecting these differential expression of highly expressed genes. Finally, we provide the tools as combined bioconductor packages, allowing researchers to explore and decide the best methods for their data and questions.

Glioblastoma (GBM) is a highly aggressive brain tumor with an extremely poor 5-year survival rate of 6.9%, largely attributable to the lack of reliable biomarkers. While competing endogenous RNA (ceRNA) and copy number variation (CNV) analyses offer unique biomarker identification potential, current approaches neglect the integration of multiple regulatory mechanisms for biomarker detection. To address this limitation, we applied relational graph convolutional networks (RGCNs) to ceRNA and CNV knowledge graphs through a novel late fusion ensemble architecture. The proposed architecture outperformed baseline models and identified five novel biomarkers, including hsa-miR-196a and hsa-miR-224. Kaplan-Meier survival analysis and Cox regression indicated that the identified genes hold significant prognostic and diagnostic power. The early stratification of the Kaplan-Meier curves indicates the potential these genes hold for patient survival prediction. The results illustrate that a late fusion RGCN ensemble effectively captures complex gene interactions, overcoming limitations of existing models and providing a framework for biomarker discovery. The novel biomarkers serve as prospective targets for future GBM therapeutic development and candidates for non-invasive diagnostic assays.

Accurate identification of drug-target interactions is consequential for novel drug discovery and development. Deep learning methods for drug-target affinity (DTA) prediction have shown great promise in accelerating drug discovery and reducing development costs. Although graph neural networks have improved drug representation learning for DTA prediction tasks, many models still struggle to effectively and efficiently capture protein information, limiting overall prediction accuracy. In this work, we systematically evaluate the impact of pre-trained protein language models (PLMs) on the downstream task of predicting binding affinity between drugs and target proteins. We design multiple experiments across four different molecular representation backbones and assess the effect of incorporating PLM embeddings, comparing their performance to classical 1D convolution methods. We evaluate four families of PLMs which we integrate into PLM-GraphDTA, each built on distinct architectures and optimized for different tasks, including structure prediction, function prediction, and sequence unmasking. Additionally, we evaluate DeepGraphDTA, an architectural modification of the baseline convolution method designed to improve protein representation learning. The models are evaluated on two benchmark datasets, Davis and KIBA, using concordance index (CI) and mean squared error (MSE) as performance metrics. We further evaluate the generalization power of each model using cold-start train and test splits, and analyze the per-protein contribution to total CI. The results indicate simple architectural modifications to traditional convolution methods may be sufficient to bridge the gap to large pre-trained PLMs.

Integrative analysis of the properties of multiple networks pertaining to a biological system is a key problem in systems biology. But computing the properties of thousands of large networks poses a challenge. Most techniques that partially address this challenge, such as parallelism and optimized algorithms, treat the analysis of each network as an independent task. However, the networks arising from the same biological system are often similar to each other, and can we harness this similarity to achieve speedup? Towards this end, we propose a phylogeny-like data structure, nc-tree, to compactly represent an ensemble of related biological networks; and a versatile framework, ProcessNets, that runs incremental algorithms over the nc-tree to speedup property computations on the input networks. Our asymptotic analysis of space and time complexity, coupled with empirical evaluations of diverse ensembles of simulated and real-world GTEx gene coexpression networks, demonstrate that ProcessNets leads to significant space and time advantages when computing different network science measures on ensembles of similar networks. For instance, we achieve a compression factor of 2.1x and 8.1x in storing two representative ensembles of GTEx Muscle Skeletal networks with 1000 nodes/genes, and a time speedup of 2.86x to 3.97x over the fastest baseline for computing degree centrality in ensembles of networks with at least 14,500 nodes derived from subsampled GTEx datasets of ten tissues. These results are promising and encourage application of ProcessNets to analyze biological network ensembles derived from rapidly accumulating consortium/biobank-based datasets.

Acute myocardial infarction (AMI) is one of the leading cardiovascular diseases worldwide and remains a major cause of mortality. Early risk prediction can help clinicians identify high risk patients shortly after admission and support timely monitoring and individualized treatment. Previous AMI risk assessment approaches predominantly rely on a single model structure or fixed feature representation, which may limit their ability to capture diverse risk related patterns and reduce predictive performance. To address these challenges, we propose MetaAMI, a random projection based meta-learning framework for AMI outcome prediction. Specifically, patients were selected based on ICD-9 and ICD-10 diagnostic codes for AMI from the Medical Information Mart for Intensive Care IV (MIMIC-IV) v3.1 database. Features were transformed through multiple random projections, with each random projection generating a distinct lower dimensional feature representation. Subsequently, baseline classifiers were trained on each lower dimension representation to predict in-hospital mortality among AMI patients. The predictions were aggregated to construct an integrated feature representation, which was used as input to a meta-learner architecture. By effectively integrating complementary information from diverse baseline models, the meta-learner refined the decision boundary and enhanced overall predictive performance. Survival analysis and SHapley Additive exPlanations (SHAP) analysis were further performed to evaluate clinical utility and interpret the model predictions. Benchmarking results based on MIMIC-IV dataset suggested that our MetaAMI consistently outperformed all the baseline classifiers across seven evaluation metrics including Accuracy, Area Under the Curve (AUC), F1 Score, G-Measure, Jaccard Index, Youden J, and Matthews Correlation Coefficient (MCC). In addition, feature importance analysis showed clinically relevant predictors of in-hospital mortality. In summary, MetaAMI provides an effective and robust solution for machine learning based AMI risk prediction. We anticipate that the application of MetaAMI will have a positive impact on clinical risk stratification and personalized treatment strategies for AMI.

BackgroundAdverse drug-drug interactions (DDIs) cause preventable hospitalizations, but exhaustive experimental screening of all drug pairs is infeasible. Many computational predictors rely on SMILES or other molecular representations, limiting their direct applicability to biologics and other non-small-molecule therapeutics. We present a structure-agnostic framework that combines semantic representations derived from Medical Subject Headings (MeSH) with graph-derived topology from a Drug-Target-Protein knowledge graph constructed from DrugBank and UniProt. We further investigate how variation in MeSH annotation depth affects predictive performance. ResultsDrugs are grouped according to their deepest MeSH annotation level (Low, Mid, or Deep), and performance is evaluated across the resulting interaction categories in transductive and inductive settings. The Intermediate ontology scope (Low+Mid) provides the most stable performance, while adding Deep-level terms offers limited and inconsistent benefit. Lightweight topological descriptors are integrated with MeSH features through instance-wise, dimension-specific latent-space gating, using curated reliable-negative pairs for supervision. Fusion improves mean performance over the MeSH-only baseline across all six categories in the transductive setting. Under induction, the clearest gains occur for Low-Low interactions ({Delta}AUROC = 0.056;{Delta} F1 = 0.137) and Low-Mid interactions ({Delta}AUROC = 0.077;{Delta} F1 = 0.114). ConclusionsMeSH annotation depth is associated with systematic variation in DDI prediction performance that aggregate evaluation can obscure. Graph-derived topology is particularly beneficial when ontology annotations are shallow. The framework provides a common, structure-agnostic representation compatible with both small-molecule and biologic therapeutics and supports first-pass DDI prioritization for subsequent expert assessment.

Over the past decade, aptamers have emerged as promising therapeutics, with cancer therapeutics as a major research area. Existing computational methods, however, either predict aptamer-target pairs or design aptamers against a specific target. In this study, we present AntiCapt, a computational method for identifying single-stranded DNA (ssDNA) anticancer aptamers (ACAs) using sequence descriptors and fine-tuned nucleotide language models. The main dataset comprises 1,021 experimentally validated ACAs and an equal number of non-aptamer sequences. Comparative analysis revealed distinct patterns in the nucleotide, dinucleotide, and trinucleotide compositions associated with ACAs. We developed machine learning (ML) models using composition, autocorrelation, binary profiles and structural features. Among these, the best-performing composition-based model achieved an AUC of 0.93 on an independent dataset, while chemical descriptor-and structural feature-based models achieved a maximum AUC of 0.89. ML models using pretrained and fine-tuned NLM embeddings were also developed, with fine-tuned HyenaDNA embeddings achieving the highest performance, with an independent AUC of 0.94. Furthermore, we developed a model for discriminating anticancer aptamers from general aptamers. The best-performing models were integrated into AntiCapt, a web server and a standalone tool for predicting, designing, and genome-scale scanning anticancer aptamers (https://webs.iiitd.edu.in/raghava/anticapt/).